Intersection dimension and graph invariants
نویسندگان
چکیده
We show that the intersection dimension of graphs with respect to several hereditary properties can be bounded as a function maximum degree. As an interesting special case, we circular graph degree Δis at most O(ΔlogΔ/log logΔ) . It is also shown permutation any Δ(log Δ)1+o(1). obtain bounds on in terms treewidth.
منابع مشابه
Graph Invariants and Graph Isomorphism
In graph theory, Graph Isomorphism is an important issue. Information in the database can be stored in the form of graph. Graph represents the structural information in an efficient way. Graph Isomorphism problem is to determine if there exists one to one correspondence between the structures of two graphs. Graph isomorphism problem arises in many fields such as chemistry, switching theory, inf...
متن کاملIntersection Dimension and Maximum Degree
We show that the intersection dimension of graphs with respect to several hereditary graph classes can be bounded as a function of the maximum degree. As an interesting special case, we show that the circular dimension of a graph with maximum degree ∆ is at most O(∆ log∆ log log∆). We also obtain bounds in terms of treewidth.
متن کاملThe small intersection graph relative to multiplication modules
Let $R$ be a commutative ring and let $M$ be an $R$-module. We define the small intersection graph $G(M)$ of $M$ with all non-small proper submodules of $M$ as vertices and two distinct vertices $N, K$ are adjacent if and only if $Ncap K$ is a non-small submodule of $M$. In this article, we investigate the interplay between the graph-theoretic properties of $G(M)$ and algebraic properties of $M...
متن کاملPlanarity of Intersection Graph of submodules of a Module
Let $R$ be a commutative ring with identity and $M$ be an unitary $R$-module. The intersection graph of an $R$-module $M$, denoted by $Gamma(M)$, is a simple graph whose vertices are all non-trivial submodules of $M$ and two distinct vertices $N_1$ and $N_2$ are adjacent if and only if $N_1cap N_2neq 0$. In this article, we investigate the concept of a planar intersection graph and maximal subm...
متن کاملIntersection theorems under dimension constraints
In [8] we posed a series of extremal (set system) problems under dimension constraints. In the present paper we study one of them: the intersection problem. The geometrical formulation of our problem is as follows. Given integers 0 ≤ t, k ≤ n determine or estimate the maximum number of (0, 1)–vectors in a k–dimensional subspace of the Euclidean n–space Rn, such that the inner product (“intersec...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discussiones Mathematicae Graph Theory
سال: 2021
ISSN: ['1234-3099', '2083-5892']
DOI: https://doi.org/10.7151/dmgt.2173